Approximating 1-dimensional TSP Requires Omega(n log n) Comparisons
نویسنده
چکیده
We give a short proof that any comparison-based (n 1−ǫ)-approximation algorithm for the 1-dimensional Traveling Salesman Problem (TSP) requires Ω(n log n) comparisons.
منابع مشابه
Connecting the Complexities of Approximating Clique and TSP
This paper demonstrates a connection between the complexity of finding approximate solutions to the MaxClique problem and that of the Traveling Salesman Problem (TSP). The main result of the paper is: MaxClique≤m 2-approximating MaxClique =⇒ TSP≤m 2-approximating TSP, where ≤m denotes many-one reductions between functions. Previously, it was known that TSP ≤m -reduces to (1+n− )-approximating T...
متن کاملLogarithmic Bounds on an Algorithm for Asymmetric TSP
In 1982 Frieze, Galbiati and Maffioli (Networks 12:23-39) published their famous algorithm for approximating the TSP tour in an asymmetric graph with triangle inequality. They show that the algorithm approximates the TSP tour within a factor of log 2 n. We construct a family of graphs for which the algorithm (with some implementation details specified by us) gives an approximation which is log ...
متن کاملWorst Case Performance of Approximation Algorithm for Asymmetric TSP
In 1982 Frieze, Galbiati and Maffioli [3] invented their famous algorithm for approximating the TSP tour in an asymmetric graph. They show that the algorithm approximates the TSP tour within a factor of log n. We construct a family of graphs for which the algorithm (with some implementation details specified by us) gives an approximation in Ω(log n). This shows that the analysis by Frieze et al...
متن کاملOn Approximating the TSP with Intersecting Neighborhoods
In the TSP with neighborhoods problem we are given a set of n regions (neighborhoods) in the plane, and seek to find a minimum length TSP tour that goes through all the regions. We give two approximation algorithms for the case when the regions are allowed to intersect: We give the first O(1)-factor approximation algorithm for intersecting convex fat objects of comparable diameters where we are...
متن کاملA near-optimal approximation algorithm for Asymmetric TSP
5 We present a near-optimal polynomial-time approximation algorithm for the asymmetric 6 traveling salesman problem for graphs of bounded orientable or non-orientable genus. Our al7 gorithm achieves an approximation factor of O(f(g)) on graphs with genus g, where f(n) is the 8 best approximation factor achievable in polynomial time on arbitrary n-vertex graphs. In par9 ticular, the O(log n/ log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1303.2920 شماره
صفحات -
تاریخ انتشار 2013